GPU Bucket Sort Algorithm with Applications to Nearest-neighbour Search
نویسندگان
چکیده
We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture. Our implementation employs render-to-texture to enable scatter operation. Linked lists of elements in each bucket are build and stored directly in video memory. We show also the use of this sorting method in a particle-based simulation. Dissipative Particle Dynamics is the physical model of choice; the simulation is performed entirely on the graphics hardware. GPU bucket sorting is used to build nearest-neighbour maps on a regular cell-grid which are the input of interparticle interaction computation. Finally we implement a simple random-number generator which is required by the DPD method.
منابع مشابه
Model Checking via Delayed Duplicate Detection on the GPU
In this paper we improve large-scale disk-based model checking by shifting complex numerical operations to the graphic card, enjoying that during the last decade graphics processing units (GPUs) have become very powerful. For disk-based graph search, the delayed elimination of duplicates is the performance bottleneck as it amounts to sorting large state vector sets. We perform parallel processi...
متن کاملDeterministic Sample Sort For GPUs
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU Bucket Sort) is not only considerably faster than the best comparison-based sorting algorithm for GPUs (Thrust Merge [Satish et.al., Proc. IPDPS 2009]) but also as fast as randomized sample sort for GPUs (GPU Sample Sort [Leischner et.al., Proc. IPDPS 2010]). However, deterministic sample sort has the advantage that ...
متن کاملThe Area Code Tree for Approximate Nearest Neighbour Search in Dense Point Sets
In this paper, we present an evaluation of nearest neighbour searching using the Area Code tree. The Area Code tree is a trie-type structure that organizes area code representations of each point of interest (POI) in a data set. This data structure provides a fast method for locating an actual or approximate nearest neighbour POI for a query point. We first summarize the area code generation, i...
متن کاملFast k-NNG Construction with GPU-Based Quick Multi-Select
In this paper, we describe a new brute force algorithm for building the k-Nearest Neighbor Graph (k-NNG). The k-NNG algorithm has many applications in areas such as machine learning, bio-informatics, and clustering analysis. While there are very efficient algorithms for data of low dimensions, for high dimensional data the brute force search is the best algorithm. There are two main parts to th...
متن کاملA comparison of k-nearest neighbour algorithms with performance results on speech data
The (k-)nearest neighbour problem is well known in a wide range of areas. Many algorithms to tackle this problem suffer from the “curse of dimensionality” which means that the execution time grows exponentially with increasing dimension. Therefore, it is important to have efficient algorithms for the problem. In this report, some well known tree-based algorithms for the k-nearest neighbour are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of WSCG
دوره 16 شماره
صفحات -
تاریخ انتشار 2008